Applying the Extended Network Simplex Algorithm and a Greedy Search Method to Automated Guided Vehicle Scheduling
نویسندگان
چکیده
In this paper, a scheduling problem for Automated Guided Vehicles in container terminals is defined and formulated as a Minimum Cost Flow model. This problem is then solved by a novel algorithm, NSA+, which extended the standard Network Simplex Algorithm (NSA). Like NSA, NSA+ is a complete algorithm, which means it guarantees optimality of the solution if it finds one within the time available. To complement NSA+, an incomplete algorithm Greedy Vehicle Search (GVS) is designed and implemented. The NSA+ and GVS are compared and contrasted to evaluate their relative strength and weakness. With polynomial time complexity, NSA+ can be used to solve very large problems, as verified in our experiments. Should the problem be too large for NSA+, or the time available for computation is too short (as it would be in dynamic scheduling), GVS complements NSA+.
منابع مشابه
An Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملApplying the Extended Network Simplex Algorithm to Dynamic Automated Guided Vehicle Scheduling
Scheduling of vehicles in the container terminal is often studied as a static problem in the literature, where all information, including the number of jobs, their arrival time, etc., is known beforehand. The objective is generally minimizing the total travelling and/or waiting times of the vehicles. When the situation changes, for example new jobs arrive or a section of the terminal is blocked...
متن کاملApplying the Extended Network Simplex Algorithm to Dynamic Automated Guided Vehicles Scheduling
Scheduling of vehicles in the container terminal is often studied as a static problem in the literature, where all information, including the number of jobs, their arrival time, etc., is known beforehand. The objective is generally minimizing the total travelling and/or waiting times of the vehicles. When the situation changes, for example new jobs arrive or a section of the terminal is blocked...
متن کامل